Serres, Alexandre (dir.) « Penser la culture informationnelle ». Les Cahiers du Numérique, Numéro thématique, vol . 5, n°3. Paris : Hermès Lavoisier, 2009. 130 p. ISBN 978-2-7462-2543-5
نویسندگان
چکیده
منابع مشابه
Les cahiers du GREYC
We define a simple transform able to map any multi-valued image into a space of patches, such that each existing image patch is mapped into a single high-dimensional point. We show that solving variational problems on this particular space is an elegant way of finding the natural patch-based counterparts of classical image processing techniques, such as the Tikhonov regularization and Lucas-Kan...
متن کاملU . K . Isbn : 978 - 988 - 17012 - 5 - 1 Wce 2009
Collaborative planning, forecasting and replenishment (CPFR) coordinates the various supply chain management activities including production and purchase planning, demand forecasting and inventory replenishment between supply chain trading partners. This study proposes a systematic way of analyzing CPFR supporting factors using fuzzy cognitive map (FCM) approach. FCMs have proven particularly u...
متن کاملCancer Immunity (5 June 2009) Vol. 9, p. 5
1Ludwig Center for Cancer Immunotherapy, Immunology Program, Sloan-Kettering Institute, New York, NY, USA 2Department of Medicine, Memorial Sloan-Kettering Cancer Center, New York, NY, USA 3Department of Epidemiology and Biostatistics, Memorial Sloan-Kettering Cancer Center, New York, NY, USA 4Ludwig Institute for Cancer Research, New York Branch, Memorial Sloan-Kettering Cancer Center, New Yor...
متن کاملLes Cahiers du GERAD ISSN : 0711 – 2440
Let G = (V,E,w) be a graph with vertex and edge sets V and E, respectively, and w : E → IR a function which assigns a positive weigth or length to each edge of G. G is called a realization of a finite metric space (M,d), with M = {1, ..., n} if and only if {1, ..., n} ⊆ V and d(i, j) is equal to the length of the shortest chain linking i and j in G ∀i, j = 1, ..., n. A realization G of (M,d), i...
متن کاملLes Cahiers du GERAD ISSN : 0711 – 2440
Conjectures in graph theory have multiple forms and involve graph invariants, graph classes, subgraphs, minors and other concepts in premisses and/or conclusions. Various abstract criteria have been proposed in order to find interesting ones with computeraided or automated systems for conjecture-making. Beginning with the observation that famous theorems (and others) have first been conjectures...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Documentation et bibliothèques
سال: 2010
ISSN: 0315-2340,2291-8949
DOI: 10.7202/1029139ar